Problems and Results in Graph Theory and Combinatorial Analysis

I published several papers with similar titles. One of my latest ones [13] (also see [16] and the yearly meetings at Boca Raton or Baton Rouge) contains, in the introduction, many references to my previous papers . I discuss here as much as possible new problems, and present proofs in only one case. I use the same notation as used in my previous papers . G(' )(n ;1) denotes an r-graph (uniform hypergraph all of whose edges have size r) of n vertices and I edges . If r = 2 and there is no danger of confusion . I omit the upper index r = 2 . K ( r ) (n) denotes the complete hypergraph G ( ' ) (n ; (;)) . K(a, b) denotes the complete bipartite graph (r = 2) of a white and b black vertices . K (r )(t) denotes the hypergraph of It vertices x (i ' ) , I < i < t, 1 < j < 1, and whose (I)tr edges are {x,1t ) , . . . , x~ )} where all the i's and all the j's are distinct . e(G(in)) is the number of edges of G(m) (graph of m vertices), the girth is the length of a smallest circuit of the graph .